class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        if(nums.size()==0)
        {
            return {-1,-1};
        }
        vector<int> ret;
        int left=0,right=nums.size(),ans=-1;
        while(left<=right)
        {
            int mid=left+(right-left)/2;
            if(nums[mid]<target)
            {
                left=mid+1;
            }
            else
            {
                if(nums[mid]==target)
                {
                    ans=mid;
                }
                right=mid-1;
            }
        }
        ret.push_back(ans);
        left=0,right=nums.size()-1,ans=-1;
        while(left<=right)
        {
            int mid=left+(right-left)/2;
            if(nums[mid]>target)
            {
                right=mid-1;
            }
            else
            {
                if(nums[mid]==target)
                {
                    ans=mid;
                }
           
                left=mid+1;
            }
        }
        ret.push_back(ans);
        return ret;
    }
};